package com.ting.test.algorithms.二叉树;

import java.util.List;

/**
 * Created by 雷霆 on 2020/3/15.
 * <p>
 * Description：
 */
public class NTreeNode {
    int val;
    List<NTreeNode> childrens;

    NTreeNode(int x) {
        val = x;
    }

    public NTreeNode(int val, List<NTreeNode> childrens) {
        this.val = val;
        this.childrens = childrens;
    }

    public int getVal() {
        return val;
    }

    public void setVal(int val) {
        this.val = val;
    }

    public List<NTreeNode> getChildrens() {
        return childrens;
    }

    public void setChildrens(List<NTreeNode> childrens) {
        this.childrens = childrens;
    }
}
